منابع مشابه
Knapsack problems with setups
RÉSUMÉ : We consider two variants of knapsack problems with setups arising as subproblems in a DantzigWolfe decomposition approach to more complex combinatorial optimization problems. In the multiple-class binary knapsack problem with setups, items are partitioned into classes whose use implies a setup cost and associated capacity consumption. Item weights are assumed to be a multiple of their ...
متن کاملA cross entropy algorithm for the Knapsack problem with setups
In this article we propose a new metaheuristic-based algorithm for the Integer Knapsack Problem with Setups. This problem is a generalization of the standard Integer Knapsack Problem, complicated by the presence of setup costs in the objective function as well as in the constraints. We propose a cross entropy based algorithm, where the metaheuristic scheme allows to relax the original problem t...
متن کاملExact approaches for the knapsack problem with setups
We consider a generalization of the knapsack problem in which items are partitioned into classes, each characterized by a fixed cost and capacity. We study three alternative Integer Linear Programming formulations. For each formulation, we design an efficient algorithm to compute the linear programming relaxation (one of which is based on Column Generation techniques). We theoretically compare ...
متن کاملKnapsack Problems with Random Budgets
Given a set of elements, each having a profit and cost associated with it, and a budget, the 0-1 knapsack problem finds a subset of the elements with maximum possible combined profit subject to the combined cost not exceeding the budget. In this paper we study a stochastic version of the problem in which the budget is random. We propose two different formulations of this problem, based on diffe...
متن کاملFinancial Planning with 0-1 Knapsack Problems, Part Ii: Using Domination Results to Solve Knapsack Problems
Part II uses domination results in knapsack problems to assist in generating solutions more rapidly and with less work. In particular, domination results are used to: (1) generate smaller problems so that less work is needed to solve the problems, and (2) speed up solution by pruning the variable sets that must be examined. Three solution processes are examined in Part II. Domination resultS ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2009
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2008.05.001